相对论性无自旋粒子在Hartmann势场中运动的精确解

在标量势等于矢量势的条件下,本文获得了具有Hartmann型势的Klein-Gordon方程的精确解.给出了束缚态的精确的能谱方程和归一化的径向波函数,对于散射态,获得了按“k/2π标度”归一化的径向波函数和相移的解析计算公式.讨论了散射振幅的解析性质和波函数、能谱方程以及相移的非相对论近似.     

Scale Invariance Properties in the Simulated Annealing Algorithm

The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed.     

有界变量线性规划的基线算法

本文对有界变量线性规划的算法进行了研究，得到了一种解此问题的新算法。文中根据基线算法的算法原理，通过对BL表的旋转，在各变量满足界约束的条件下，使目标函数值不断增大，直至得到有界硬上界，从而得到问题的最优解。文中给出了有界变量线性规划基线算法的计算步骤，并给出了一个例子。与单纯形法相比，采用基线算法解有界变量线性规划操作更简单。迭代次数少，解题速度更快。     

A branch and bound algorithm for the robust shortest path problem with interval data

Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs.A branch and bound algorithm for this problem is presented.     

A New Simple Ultrahigh Speed Decoding Algorithm for BCH Code

1　Ｉｎｔｒｏｄｕｃｔｉｏｎ　　Ｍｏｄｅｒｎｄｉｇｉｔａｌｃｏｍｍｕｎｉｃａｔｉｏｎｓｙｓｔｅｍｓｏｆｔｅｎｒｅｑｕｉｒｅｅｒｒｏｒ ｆｒｅｅｔｒａｎｓｍｉｓｓｉｏｎ .Ｅｒｒｏｒｃｏｎｔｒｏｌｃｏｄｉｎｇｔｅｃｈｎｏｌｏｇｙｈａｓｂｅｅｎｕｓｅｄｗｉｄｅｌｙｉｎｃｏｍｍｕｎｉｃａｔｉｏｎｓｙｓｔｅｍ .Ａｎｄｉｔｈａｓｂｅｅｎｉｍｐｒｏｖｉｎｇｔｈｅｐｅｒｆｏｒｍａｎｃｅｏｆｃｏｍｍｕｎｉｃａｔｉｏｎｓｙｓｔｅｍ ｇｒｅａｔｌｙ ,ｅｓｐｅｃｉａｌｌｙｉｎｗｉｒｅｌｅｓｓｃｏｍｍｕｎｉｃａｔｉｏｎｓｓ…     

Performance Enhancement for Optical Fast Frequency-hopping CDMA Systems by BCH Channel Coding

In this paper, the impact of optical beat noise on the performance of optical fast frequency-hopping code-division multiple-access (FFH OCDMA) networks is analyzed. BCH/FFH-OCDMA to reduce the impact of optical beat noise is proposed. It is shown that, BCH/FFH-OCDMA has much better performance under the same bit rate, same chip time and same number of available wavelengths. Another advantage for BCH/FFH-OCDMA is that the code length of one-coincidence sequence will be shorter, which can greatly reduce the difficulty of fabrication for fiber gratings.     

THE EIGENVALUE PERTURBATION BOUND FOR ARBITRARY MATRICES

In this paper we present some new absolute and relative perturbation bounds for theeigenvalue for arbitrary matrices, which improves some recent results. The eigenvalueinclusion region is also discussed.     

A note on worst-case performance of heuristics for maintenance scheduling problems

We study a machine scheduling model in which job scheduling and machine maintenance activities have to be considered simultaneously. We develop the worst-case bounds for some heuristic algorithms, including a sharper worst-case bound of the SPT schedule than the results in the literature, and another bound of the EDD schedule.